A Modified Halpern’s Iterative Scheme for Solving Split Feasibility Problems

نویسندگان

  • Jitsupa Deepho
  • Poom Kumam
  • Hong-Kun Xu
چکیده

and Applied Analysis 3 PK is called the metric projection ofH ontoK. It is well known that PK is a nonexpansive mapping ofH onto K and satisfies 〈x − y, PKx − PKy〉 ≥ ∥ PKx − PKy ∥ ∥ 2 , 2.3 for every x, y ∈ H. Moreover, PKx is characterized by the following properties: PKx ∈ K and 〈x − PKx, y − PKx〉 ≤ 0, ∥ ∥x − y∥∥ ≥ ‖x − PKx‖ ∥ ∥y − PKx ∥

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Iterative Algorithm for Multivalued Nonexpansive Mappping and Equlibruim Problems with Applications

In this paper, we introduce two iterative schemes by a modified Krasnoselskii-Mann algorithm for finding a common element of the set of solutions of equilibrium problems and the set of fixed points of multivalued nonexpansive mappings in Hilbert space. We prove that the sequence generated by the proposed method converges strongly to a common element of the set of solutions of equilibruim proble...

متن کامل

A Third-degree B-spline Collocation Scheme for Solving a Class of the Nonlinear Lane–-Emden Type Equations

In this paper, we use a numerical method involving collocation method with third B-splines as basis functions for solving a class of singular initial value problems (IVPs) of Lane--Emden type equation. The original differential equation is modified at the point of singularity. The modified problem is then treated by using B-spline approximation. In the case of non-linear problems, we first line...

متن کامل

A Modified Algorithm for Solving the Split Feasibility Problem

In this paper a modified algorithm for solving the split feasibility problem (SFP) is presented. This algorithm uses the generalized Armijo line search in computing predictor step size and gives a correction step rule in the iterative process, which makes an accelerated convergence to the solution of SFP. Meanwhile, it needs not to compute the matrix inverses and the large eigenvalue of the mat...

متن کامل

A Modified Iterative Algorithm for Split Feasibility Problems of Right Bregman Strongly Quasi-Nonexpansive Mappings in Banach Spaces with Applications

In this paper, we present a new iterative scheme for finding a common element of the solution set F of the split feasibility problem and the fixed point set F(T) of a right Bregman strongly quasi-nonexpansive mapping T in p-uniformly convex Banach spaces which are also uniformly smooth. We prove strong convergence theorem of the sequences generated by our scheme under some appropriate condition...

متن کامل

Solving systems of nonlinear equations using decomposition technique

A systematic way is presented for the construction of multi-step iterative method with frozen Jacobian. The inclusion of an auxiliary function is discussed. The presented analysis shows that how to incorporate auxiliary function in a way that we can keep the order of convergence and computational cost of Newton multi-step method. The auxiliary function provides us the way to overcome the singul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014